Optimal algorithms of Gram–Schmidt type

Optimal Gram-schmidt Type Algorithms

A Gram-Schmidt type algorithm is given for finite d-dimensional reflexive forms over division rings. The algorithm uses d/3 + O(d) ring operations. Next, that algorithm is adapted in two new directions. First a sequential algorithm is given whose complexity matches the complexity of matrix multiplication. Second, a parallel NC algorithm is given with similar complexity.

Approximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms

In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced‎. ‎In this approach‎, ‎first a discretized form of the time-control space is considered and then‎, ‎a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...

OPTIMAL CONSTRAINED DESIGN OF STEEL STRUCTURES BY DIFFERENTIAL EVOLUTIONARY ALGORITHMS

Structural optimization, when approached by conventional (gradient based) minimization algorithms presents several difficulties, mainly related to computational aspects for the huge number of nonlinear analyses required, that regard both Objective Functions (OFs) and Constraints. Moreover, from the early '80s to today's, Evolutionary Algorithms have been successfully developed and applied as a ...

the investigation of the relationship between type a and type b personalities and quality of translation

چکیده ندارد.

Theory of optimal algorithms